Quantum secret sharing via local operations and classical communication
نویسندگان
چکیده
We investigate the distinguishability of orthogonal multipartite entangled states in d-qudit system by restricted local operations and classical communication. According to these properties, we propose a standard (2, n)-threshold quantum secret sharing scheme (called LOCC-QSS scheme), which solves the open question in [Rahaman et al., Phys. Rev. A, 91, 022330 (2015)]. On the other hand, we find that all the existing (k, n)-threshold LOCC-QSS schemes are imperfect (or "ramp"), i.e., unauthorized groups can obtain some information about the shared secret. Furthermore, we present a (3, 4)-threshold LOCC-QSS scheme which is close to perfect.
منابع مشابه
Quantum vernam cipher
We discuss aspects of secure quantum communication by proposing and analyzing a quantum analog of the Vernam cipher (one-time-pad). The quantum Vernam cipher uses entanglement as the key to encrypt quantum information sent through an insecure quantum channel. First, in sharp contrast with the classical Vernam cipher, the quantum key can be recycled securely. We show that key recycling is intrin...
متن کاملHybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding
With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) p...
متن کاملQuantum secret sharing based on local distinguishability
In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis we propose a new scheme for quantum secret sharing (QSS). Our QSS scheme is quite general and cost efficient compared to other schemes. In our scheme no joint quantum...
متن کاملCommunication Efficient Quantum Secret Sharing
Building upon the recent work in communication efficient classical secret sharing schemes of Bitar and El Rouayheb, we study communication efficient quantum secret sharing schemes. In the standard model of quantum secret sharing, typically one is interested in minimal authorized sets for the reconstruction of the secret. In such a setting, reconstruction requires the communication of all the sh...
متن کاملQuantum data hiding
We expand on our work on Quantum Data Hiding [1] – hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 5 شماره
صفحات -
تاریخ انتشار 2015